Recursive blocked algorithms for linear systems with Kronecker product structure
نویسندگان
چکیده
منابع مشابه
Blocked and Recursive Algorithms for Triangular Tridiagonalization
We present partitioned (blocked) algorithms for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithms compute a factorization PAP = LTL where P is a permutation matrix, L is lower triangular with a unit diagonal, and T is symmetric and tridiagonal. The algorithms are based on the column-by-column methods of Parlett and Reid and of Aasen. Our implement...
متن کاملShifted Kronecker Product Systems
Abstract. A fast method for solving a linear system of the form (A(p) ⊗ · · · ⊗ A(1) − λI)x = b is given where each A(i) is an ni-by-ni matrix. The first step is to convert the problem to triangular form (T (p) ⊗ · · · ⊗ T (1) − λI)y = c by computing the (complex) Schur decompositions of the A(i). This is followed by a recursive back-substitution process that fully exploits the Kronecker struct...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولRegularization Operators for Multidimensional Inverse Problems with Kronecker Product Structure
Regularization operators that penalize derivatives are approximated by Kronecker products. This allows direct regularization of multidimensional first-kind linear integral equations with separable kernels. An example of image deblurring is presented.
متن کاملKrylov Subspace Methods for Linear Systems with Tensor Product Structure
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a linear PDE on a d-dimensional hypercube. Linear systems with tensor product structure can be regarded as linear matrix equations for d = 2 and appear to be their most natural extension for d > 2. A standard Krylov subspace...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2019
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-019-00797-5